Hammering Floating-Point Arithmetic

نویسندگان

چکیده

Abstract Sledgehammer, a component of the interactive proof assistant Isabelle/HOL, aims to increase automation by automatically discharging goals with help external provers. Among these provers are group satisfiability modulo theories (SMT) solvers support for SMT-LIB input language. Despite existing formalizations IEEE floating-point arithmetic in both Isabelle/HOL and SMT-LIB, Sledgehammer employs an abstract translation types constants, depriving SMT opportunity make use their dedicated decision procedures arithmetic. We show that, extending Sledgehammer’s from language into interpretation reasoning can be made available Isabelle/HOL. Our main contribution is description implementation such extension. An evaluation extended shows significant success rate on involving

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Precision Arithmetic: A New Floating-Point Arithmetic

A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid the excessive rounding error propagation of conventional floating-point arithmetic. Unlike interval arithmetic, its uncertainty tracking is based on statistics and the central limit theorem, with a much tighter bounding r...

متن کامل

Design Exploration for Decimal Floating-Point Arithmetic

Commercial applications and databases typically store numerical data in decimal format. Currently, however, microprocessors do not provide instructions or hardware support for decimal floating-point arithmetic [ 1 ]. Consequently, decimal numbers are often read into computers, converted to binary numbers, and then processed using binary floating-point arithmetic. Results are then converted back...

متن کامل

New directions in floating-point arithmetic

o Konrad Zuse’s Z1, Z3, and Z4 (1936–1945): 22-bit (Z1 and Z3) and 32-bit Z4 with exponent range of 2±63 ≈ 10±19 o Burks, Goldstine, and von Neumann (1946) argued against floating-point arithmetic o It is difficult today to appreciate that probably the biggest problem facing programmers in the early 1950s was scaling numbers so as to achieve acceptable precision from a fixed-point machine, Mart...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-43369-6_12